Descriptive characterizations of computational complexity

Descriptive and Computational Complexity

Computational complexity began with the natural physical notions of time and space Given a property S an important issue is the computational complexity of checking whether or not an input satis es S For a long time the notion of complexity referred to the time or space used in the compu tation A mathematician might ask What is the complexity of expressing the property S It should not be surpri...

The Computational Complexity Column Progress in Descriptive Complexity

Exploration of the connections between computational complexity, descriptive complexity, and logic remains one of the most active and important areas of theoretical computer science. In this edition of the Computational Complexity Column, we hear from one of the leaders in this area.

Workshop on Computational, Descriptive and Proof Complexity, and Algorithms

Farid Ablayev. Classical Simulation Complexity of Bounded Error Quantum Branching Programs We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function with error δ we present a classical deterministic branching program of the same length and width at most (1 + 2/(1− 2δ)) that co...

Logical Characterizations of Complexity Classes

On the Computational Complexity of the Domination Game

The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...